Multipartite entangled states, such as Greenberger–Horne–Zeilinger (GHZ) and other graph states, are essential for quantum networks and measurement-based computing. We explore their generation from bipartite entangled (Bell) pairs networks. While an existing optimal protocol (in terms of time steps and consumed Bell pairs) produces GHZ states in Bell-pair networks, it scales quadratically in the number of gates and requires solving the NP-hard Steiner tree problem. Since gate operations are noisy, reducing the number of gates is crucial. We present a protocol that scales linearly in the number of gates, remains independent of network topology, and maintains nearly optimal Bell-pair consumption. Unlike previous methods, it avoids computationally hard problems and runs in polynomial time. By prioritizing gate efficiency, our approach acknowledges that local operations and classical communication are not free in practice.

I am a PhD student in theoretical quantum information. My work is mostly on quantum repeaters, networks and error correction.